A DL-Lite Ontology Revision Based on An Alternative Semantic Characterisation
نویسندگان
چکیده
Ontology engineering and maintenance require (semi-)automated ontology change operations. Intensive research has been conducted on TBox and ABox changes in description logics (DLs), and various change operators have been proposed in the literature. Existing operators largely fall into two categories: syntax-based and model-based. While each approach has its advantages and disadvantages, an important topic that has been rarely explored is how to achieve a balance between syntax-based and model-based approaches. Also, most existing operators are specially designed for either TBox change or ABox change, and cannot handle the general ontology revision task—Given a DL knowledge base (KB, a pair of a TBox and an ABox), how to revise it by a set of TBox and ABox axioms (i.e., a new DL KB). In this paper, we introduce an alternative structure for DL-Lite, called a featured interpretation, and show that featured models provide a finite and tight characterisation to the classical semantics of DL-Lite. A key issue for defining a change operator is the so-called expressibility, that is, whether a set of models (or featured models here) is axiomatizable in DLs. It is indeed much easier to obtain expressibility results for featured models than for classical DL models. As a result, the new semantics determined by featured models provides a method for defining and studying various changes of DL-Lite KBs that involve both TBoxes and ABoxes. To demonstrate the usefulness of the new semantic characterisation in ontology change, we define two revision operators for DL-Lite KBs using featured models and study their properties. In particular, we show that our two operators both satisfy AGM postulates. We show that the complexity of our revisions is Π2 -complete, that is, on the same level as major revision operators in propositional logic, which further justifies the feasibility of our revision approach for DL-Lite. Also, we develop algorithms for these DL-Lite revision operations.
منابع مشابه
Revision of DL-Lite Knowledge Bases
We address the revision problem for knowledge bases (KBs) in Description Logics (DLs). This problem has received much attention in the ontology management and DL communities, but the existing proposals are restricted in several ways. In this paper we develop a formal framework for revision of DL-Lite KBs, using techniques that are analogous to those for model-based revision in propositional log...
متن کاملInstance-driven TBox Revision in DL-Lite
The development and maintenance of large and complex ontologies are often time-consuming and error-prone. Thus, automated ontology learning and revision have attracted intensive research interest. In data-centric applications where ontologies are designed or automatically learnt from the data, when new data instances are added that contradict to the ontology, it is often desirable to incrementa...
متن کاملA Semantic Approach to Ontology Merging in DL-Lite
This paper proposes a novel approach to merging DL-Lite ontologies by utilising an alternative semantic characterisation instead of classical DL models. The new merging process consists of two operators (TBox merging and ABox merging). These operators satisfy several desirable properties for merging, which in turn demonstrates the suitability of the new approach to DL-Lite merging. It is shown ...
متن کاملCapturing Instance Level Ontology Evolution for DL-Lite
Evolution of Knowledge Bases (KBs) expressed in Description Logics (DLs) proved its importance. Recent studies of the topic mostly focussed on model-based approaches (MBAs), where an evolution (of a KB) results in a set of models. For KBs expressed in tractable DLs, such as DL-Lite, it was shown that the evolution suffers from inexpressibility, i.e., the result of evolution cannot be expressed ...
متن کاملOntoMerge: A System for Merging DL-Lite Ontologies
This paper proposes a novel approach to merging DL-Lite ontologies by utilising an alternative semantic characterisation instead of classical DL models. It is shown that the complexity of our merging operators is on the same level as the complexity of propositional belief merging. Moreover, a new algorithm is developed for transforming the reasoning problem of DL-Lite merging into the evaluatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015